Plane geometric graph augmentation: a generic perspective∗
نویسندگان
چکیده
Graph augmentation problems are motivated by network design, and have been studied extensively in optimization. We consider augmentation problems over plane geometric graphs, that is, graphs given with a crossing-free straight-line embedding in the plane. The geometric constraints on the possible new edges render some of the simplest augmentation problems intractable, and in many cases only extremal results are known. We survey recent results, highlight common trends, and gather numerous conjectures and open problems.
منابع مشابه
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) by adding edges such that the resulting graph keeps the property. The aim is to add as few edges as possible. The property that we consider is planarity, both in an abstract graph-theoretic and in a geometric setting, where...
متن کاملGeometric Biplane Graphs II: Graph Augmentation
We study biplane graphs drawn on a finite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every sufficiently large point set admits a 5-connected biplane graph and that there are arbitrarily large point sets that do not admit any 6connected biplane graph. Furthermore, we sh...
متن کاملAn implementation of a generic memetic algorithm for the edge biconnectivity augmentation problem
In this paper we present an implementation of a generic memetic algorithm for the edge bi connectivity augmentation problem the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph edge bi connected This problem is known for its applications to communication network de sign the extension of an existing communication network to become robu...
متن کاملIntersections with random geometric objects
We present a systematic study of the expected complexity of the intersection of geometric objects. We first study the expected size of the intersection between a random Voronoi diagram and a generic geometric object that consists of a finite collection of line segments in the plane. Using this result, we explore the intersection complexity of a random Voronoi diagram with the following target o...
متن کاملGraphical Shape Templates for Automatic AnatomyDetection with Applications to MRI Brain
|A new method of model registration is proposed using graphical templates. A decomposable graph of landmarks is chosen in the template image. All possible candidates for these landmarks are found in the data image using robust relational local operators. A dynamic programming algorithm on the template graph nds the optimal match to a subset of the candidate points in polynomial time. This combi...
متن کامل